基于四元极谐变换矩与显著特征的图像鲁棒哈希算法

为了增强哈希序列对各种几何变换攻击的鲁棒性,设计基于四元极谐变换矩与显著特征的图像鲁棒哈希算法。引入线性插值与自适应Wiener滤波器,实现初始图像的预处理;计算预处理图像的颜色向量角度,并基于Fourier变换,得到其对应的幅度信息,以获取两个不同的频谱;计算两个频谱的残差,确定图像中的局部显著性区域;通过LBP算子,提取显著特征;基于四元极谐变换(Quaternion Polar Harmonic Transform,QPHT),获取预处理图像的QPHT矩;联合显著特征与QPHT矩,形成过渡哈希数组。引入Logistic映射,定义加密函数,实现对过渡哈希数组的加密,输出最终的哈希序列,以增强其抗碰撞性能。测量源图像与可疑图像之间的哈希序列所对应的l₂范数距离,并将其与优化阈值比较,对图像的真实性做出判断。在多种几何变换攻击下完成测试,输出数据显示:较当前准确性较高的哈希方法而言,该算法具有更理想的鲁棒性与识别准确率。     

Unsupervised Quick Reduct Algorithm Using Rough Set Theory

Feature selection (FS) is a process to select features which are more informative.It is one of the important steps in knowledge discovery.The problem is that not all features are important.Some of the features may be redundant,and others may be irrelevant and noisy.The conventional supervised FS methods evaluate various feature subsets using an evaluation function or metric to select only those features which are related to the decision classes of the data under consideration.However,for many data mining applications,decision class labels are often unknown or incomplete,thus indicating the significance of unsupervised feature selection.However,in unsupervised learning,decision class labels are not provided.In this paper,we propose a new unsupervised quick reduct (QR) algorithm using rough set theory.The quality of the reduced data is measured by the classification performance and it is evaluated using WEKA classifier tool.The method is compared with existing supervised methods and the result demonstrates the efficiency of the proposed algorithm.     

基于改进的监督LLE人脸识别算法

LLE是一种无监督的非线性降维方法,广泛应用于人脸特征提取,但是该方法缺乏样本点的类别信息.提出了一种新方法,在LLE的基础上引入有监督的学习机制和增加样本点的类别信息,通过减少类内距离而增加类间距离和最小化局部数据的全局重构误差,同时结合核邻域保持投影方法(KNPP)来提取高维人脸数据的非线性特征.算法有利于分类识别...     

一种基于SIFT的图像哈希算法

图像哈希是近年来颇受关注的一个研究热点,但现有的图像哈希算法普遍存在对几何攻击(主要包括尺度、旋转、剪切)鲁棒性不足的缺点,不能满足很多实际应用的需要.针对上述问题,提出了对几何攻击具有强鲁棒性的SIH图像哈希算法.本算法基于在图像匹配等领域得到广泛应用的SIFT算子,通过对SIFT特征向量进行有针对性的筛选和压缩、基于特征向量分布质心的量化生成图像摘要.为适应图像摘要构造的特性,设计了基于广义集合距的匹配算法来衡量图像摘要间的距离.在公开图像库上的实验结果表明,本算法对几何攻击和非几何攻击的鲁棒性均优于对比算法,可广泛服务于图像识别/认证类型的应用.     

基于一致哈希算法的用电信息采集系统研究

电网公司的用电信息采集系统具有数据量大、在线终端多、通道类型多和应用场景复杂等特点,传统的负载均衡的方式,在增加前置机或前置机故障时,终端协议处理都会发生大规模的迁移。文章提出了采用硬件负载均衡器实现通信负载均衡,采用一致哈希算法实现采集前置机的负载均衡;对哈希算法进行了分析比较,选择CRC32查表法,保证了哈希算法的高效、单调和均匀分布,在前置机发生变化时,仅有少数终端发生迁移,不发生终端大规模的迁移,确保负载均衡,保证了系统的稳定性和可靠性。     

Semi‐supervised classification of facial expression using a mixture of multivariate t distributions

Abstract: This paper addresses the semi‐supervised classification of facial expression images using a mixture of multivariate t distributions. The facial expression features are first extracted into labelled graph vectors using the Gabor wavelet transformation. We then learn a mixture of multivariate t distributions by using the labelled graph vectors, and set correspondence between the component distributions and the basic facial emotions. According to this correspondence, the classification of a given testing image is implemented in a probabilistic way according to its fitted posterior probabilities of component memberships. Specifically, we perform hard classification of the testing image by assigning it into an emotional class that the corresponding mixture component has the highest posterior probability, or softly use the posterior probabilities as the estimates of the semantic ratings of expressions. The experimental results on the Japanese female facial expression database, Ekman's Pictures of Facial Affect database and the AR database demonstrate the effectiveness of the proposed method.     

Gas-Chimney Detection in 3D Seismic by Neural Network

Recognition of hydrocarbon migration is so vital for petroleum exploration. Developing intelligent systems (artificial neural network) enable experts to achieve more details from seismic data. Although detection of migration direction using seismic data is difficult, Chimney-cube analysis overcomes this problem. The authors used several filters, seismic attributes, neural network (supervised and unsupervised), and interpreters' viewpoints. In supervised method artificial and human intelligence cover their limitations and in unsupervised method the authors eliminate the experts' views. Chimney recognizes the migration direction and locates the spill points, mud volcanoes, gas seepages, sealing, and nonsealing faults and finally the origin of hydrocarbon.     

Sparse spectral hashing

A better similarity index structure for high-dimensional feature datapoints is very desirable for building scalable content-based search systems on feature-rich dataset. In this paper, we introduce sparse principal component analysis (Sparse PCA) and Boosting Similarity Sensitive Hashing (Boosting SSC) into traditional spectral hashing for both effective and data-aware binary coding for real data. We call this Sparse Spectral Hashing (SSH). SSH formulates the problem of binary coding as a thresholding a subset of eigenvectors of the Laplacian graph by constraining the number of nonzero features. The convex relaxation and eigenfunction learning are conducted in SSH to make the coding globally optimal and effective to datapoints outside the training data. The comparisons in terms of F1 score and AUC show that SSH outperforms other methods substantially over both image and text datasets.     

The clustering-based case-based reasoning for imbalanced business failure prediction: a hybrid approach through integrating unsupervised process with supervised process

Case-based reasoning (CBR) is one of the main forecasting methods in business forecasting, which performs well in prediction and holds the ability of giving explanations for the results. In business failure prediction (BFP), the number of failed enterprises is relatively small, compared with the number of non-failed ones. However, the loss is huge when an enterprise fails. Therefore, it is necessary to develop methods (trained on imbalanced samples) which forecast well for this small proportion of failed enterprises and performs accurately on total accuracy meanwhile. Commonly used methods constructed on the assumption of balanced samples do not perform well in predicting minority samples on imbalanced samples consisting of the minority/failed enterprises and the majority/non-failed ones. This article develops a new method called clustering-based CBR (CBCBR), which integrates clustering analysis, an unsupervised process, with CBR, a supervised process, to enhance the efficiency of retrieving information from both minority and majority in CBR. In CBCBR, various case classes are firstly generated through hierarchical clustering inside stored experienced cases, and class centres are calculated out by integrating cases information in the same clustered class. When predicting the label of a target case, its nearest clustered case class is firstly retrieved by ranking similarities between the target case and each clustered case class centre. Then, nearest neighbours of the target case in the determined clustered case class are retrieved. Finally, labels of the nearest experienced cases are used in prediction. In the empirical experiment with two imbalanced samples from China, the performance of CBCBR was compared with the classical CBR, a support vector machine, a logistic regression and a multi-variant discriminate analysis. The results show that compared with the other four methods, CBCBR performed significantly better in terms of sensitivity for identifying the minority samples and generated high total accuracy meanwhile. The proposed approach makes CBR useful in imbalanced forecasting.     

Visual tracking via weakly supervised learning from multiple imperfect oracles

Notwithstanding many years of progress, visual tracking is still a difficult but important problem. Since most top-performing tracking methods have their strengths and weaknesses and are suited for handling only a certain type of variation, one of the next challenges is to integrate all these methods and address the problem of long-term persistent tracking in ever-changing environments. Towards this goal, we consider visual tracking in a novel weakly supervised learning scenario where (possibly noisy) labels but no ground truth are provided by multiple imperfect oracles (i.e., different trackers). These trackers naturally have intrinsic diversity due to their different design strategies, and we propose a probabilistic method to simultaneously infer the most likely object position by considering the outputs of all trackers, and estimate the accuracy of each tracker. An online evaluation strategy of trackers and a heuristic training data selection scheme are adopted to make the inference more effective and efficient. Consequently, the proposed method can avoid the pitfalls of purely single tracking methods and get reliably labeled samples to incrementally update each tracker (if it is an appearance-adaptive tracker) to capture the appearance changes. Extensive experiments on challenging video sequences demonstrate the robustness and effectiveness of the proposed method.